Multiprocessor Scheduling of Dependent Tasks to Minimize Makespan and Reliability Cost using NSGA-II
نویسندگان
چکیده
منابع مشابه
Multiprocessor Scheduling of Dependent Tasks to Minimize Makespan and Reliability Cost Using NSGA-II
Algorithms developed for scheduling applications on heterogeneous multiprocessor system focus on a single objective such as execution time, cost or total data transmission time. However, if more than one objective (e.g. execution cost and time, which may be in conflict) are considered, then the problem becomes more challenging. This project is proposed to develop a multiobjective scheduling alg...
متن کاملScheduling Tasks to Minimize the Total Computation and Communication Makespan
as the conclusion. A conclusion might elaborate on the importance of the work or suggest applications and
متن کاملScheduling Malleable Tasks on Parallel Processors to Minimize the Makespan
The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of processors is m and it is an upper bound on the number of processors that can be used by all the ...
متن کاملScheduling parallel jobs to minimize the makespan
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, job-dependent number of machines when being processed. We prove that the makespan of any nonpreemptive list-schedule is within a factor of 2 of the optimal preemptive makespan. This gives the best-known app...
متن کاملMixed-Criticality Scheduling to Minimize Makespan
In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal in Foundations of Computer Science & Technology
سال: 2014
ISSN: 1839-7662
DOI: 10.5121/ijfcst.2014.4204